Encoding Algorithm Based on LU Factorization for LDPC Codes over GF(q)

doi:10.13190/jbupt.201103.35.wenl

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2011, Vol. 34 ›› Issue (3): 35-39.doi: 10.13190/jbupt.201103.35.wenl

• Papers • Previous Articles Next Articles

Encoding Algorithm Based on LU Factorization for LDPC Codes over GF(q)

Received:2010-08-20 Revised:2011-03-03 Online:2011-06-28 Published:2011-03-29

Abstract

Abstract:

For general encoding algorithm of low density parity check (LDPC) codes over GF(q), a Tanner graph and research encoding algorithm is presented based on lower upper (LU) decomposition. In order to keep sparsity of matrix, three pivot selection criterias named row pivot, rowcolumn pivot and product of rowcolumn pivot are deduced and analyzed. Simulations show that the new algorithm could be lower than one half density compared with existing algorithm. The conclusion is useful to application of universal encoding algorithm for LDPC codes over GF(q).

Key words: Galois field, low density parity check codes, low upper factorization, pivot selection criteria

CLC Number:

TN911

References

[1] Zeng Lingqi, Lan Lan, Tai Yingyu, et al. Construction of nonbinary cyclic, quasi-cyclic and regular LDPC codes a finite geometry approach[J]. IEEE Trans on Commun, 2008, 56(3): 378-387.
[2] Braunstein A, Zecchina R, Kayhan F. Efficient LDPC codes over GF(q) for lossy data compression//ISIT 2009. Seoul: , 2009: 1978-1982.
[3] Park S E, Lim C, Lestable T, et al. A class of structured LDPC codes over GF(q) for efficient encoding//VTC2007-Spring. Dublin: , 2007: 2218-2222.
[4] Zhou Bo, Kang Jingyu, Song Shumei, et al. Construction of non-binary quasi-cyclic LDPC codes by arrays and array dispersions[J]. IEEE Trans on Communs, 2009, 57(6): 1652-1662.
[5] Song Shumei, Zeng Lingqi, Lin Shu, et al. Algebraic constructions of nonbinary quasi-cyclic LDPC codes//ISIT2006. Seattle: , 2006: 83-87.
[6] Neal R M. Sparse matrics methods and probabilistic inference algorithms. (1999). http: //www.cs.utoronto.ca/~radford/.
[7] Su Jianing, Jiang Zhou, Liu Ke, et al. An efficient low complexity LDPC encoder based on LU factorization with pivoting//ASICON 2005. Shanghai: , 2005: 107-110.
[8] Lei Jing, Wang Jianhui, Gao Yongqiang. The analysis of cycle structure for a class of quasi-cyclic LDPC codes//ICCS 2008. Krakow: , 2008: 1307-1311.
[9] Lei Jing, Tang Chaojing, Wang Jianhui. An effective algorithm for construction of LDPC codes//ICIA 2008. Zhangjiajie: , 2008: 1542-1546.
[10] 雷菁, 文磊, 高永强. 基于联合判决消息传递机制的LDPC码译码算法研究[J]. 信号处理, 2009, 25(11): 1761-1766. Lei Jing, Wen Lei, Gao Yongqiang. A decoding algorithm based on joint judging message passing schedule for low-density parity check codes[J]. Signal Processing, 2009, 25(11): 1761-1766.
[11] 林家儒, 吴伟陵. LDPC 码在RICE信道中的性能分析[J]. 北京邮电大学学报, 2004, 27(2): 71-75. Lin Jiaru, Wu Weiling. Analysis of performance of LDPC on Rician-fading channels[J]. Journal of Beijing University of Posts and Telecommunications, 2004, 27(2): 71-75.

Encoding Algorithm Based on LU Factorization for LDPC Codes over GF(q)

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 5

Recommended Articles

Metrics

Comments

[1]	. Design Optimization for Multiple Access via Power and LDPC Code [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2011, 34(4): 56-60.
[2]	ZHANG Xiang，BIE Zhi-song, WU Wei-ling. LDPC Optimization for Multiple Access Channel [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2008, 31(3): 9-12.
[3]	WU Zhan-ji, LI Lu-ying, OUYANG Zi-yue，WANG Wen-bo. Novel Efficient Decoding Implementation of LDPC Codes [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2007, 30(5): 105-107.
[4]	JIAO Shengcai，LI Li，WEN Xiangming. Research on Permutation Sequence Code for Ultra Wide Band [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2005, 28(5): 114-116.
[5]	MA Xiaolei,LIU Yuanan,GAO Jinchun，SHEN Yaqin. TopologyTransparent Transmission Scheduling Algorithms with Power Control in Wireless Ad Hoc Networks [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2005, 28(5): 42-46.